Queue-length synchronization in communication networks
نویسندگان
چکیده
منابع مشابه
Queue-length synchronization in communication networks.
We study the synchronization in the context of network traffic on a 2-d communication network with local clustering and geographic separations. The network consists of nodes and randomly distributed hubs where the top five hubs ranked according to their coefficient of betweenness centrality (CBC) are connected by random assortative and gradient mechanisms. For multiple message traffic, messages...
متن کاملQueue length synchronization in a communication network
Traffic flows on networks have been the subject of intensive study [1]. We study this problem in the context of a two dimensional lattice of nodes and hubs. When many messages flow on the lattice, hubs which lie on many message paths tend to get congested. We rank the hubs by their coefficient of betweenness centrality (CBC) [2] which is defined as the number of messages Nk running through a gi...
متن کاملOptimal Queue Length in Torus Networks with Traffic Signals
Inspired by the need for efficient traffic control in urban areas, we study the problem of minimizing the longest queue length in traffic networks. In our model cars only move forward and do not overtake each other and time is divided in rounds of a given length. Cars always cross intersections when they have the green signal and they are at the front of the queue, otherwise they wait. Each car...
متن کاملQueue Length Based Fair Queueing in Core-Stateless Networks
In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is...
متن کاملQueue Length Based Fair Queueing in Core - Stateless Networks 1
In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2009
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.79.056105